BioCD : An Efficient Algorithm for Self-collision and Distance Computation between Highly Articulated Molecular Models
نویسندگان
چکیده
This paper describes an efficient approach to (self) collision detection and distance computations for complex articulated mechanisms such as molecular chains. The proposed algorithm called BioCD is particularly designed for samplingbased motion planning on molecular models described by long kinematic chains possibly including cycles. The algorithm considers that the kinematic chain is structured into a number of rigid groups articulated by preselected degrees of freedom. This structuring is exploited by a two-level spatially-adapted hierarchy. The proposed algorithm is not limited to particular kinematic topologies and allows good collision detection times. BioCD is also tailored to deal with the particularities imposed by the molecular context on collision detection. Experimental results show the effectiveness of the proposed approach which is able to process thousands of (self) collision tests per second on flexible protein models with up to hundreds of degrees of freedom.
منابع مشابه
Efficient Collision and Self-Collision Detection for Humanoids Based on Sphere Tree Hierarchies
We present an algorithm for computing compact sphere tree hierarchies over general 3D polygonal meshes for the purpose of efficient collision detection and minimum distance computation. The sphere tree construction method we use optimizes the location of the sphere centers and radii at each level of the hierarchy to compactly contain the underlying geometry. We enhance the hierarchy constructio...
متن کاملEfficient Path Planning for Highly Articulated Robots using Adaptive Forward Dynamics
We present an efficient path planning algorithm for highly articulated robots with many degrees of freedom (DoFs). Our approach takes into account physical and geometric constraints and formulates the problem as constrained dynamic simulation. We simulate the motion of the robot using a sub-linear time adaptive forward dynamics algorithm. We also present fast collision detection and response co...
متن کاملRange of Motion Hull: An approach for detecting collision and self-collision for dynamic objects based on hierarchical sphere trees. Diploma Thesis
Collision Detection must choose a trade-off between approximative complexity, tightness of approximative fit, and cost of overlap test and distance computation. The collision detection system must be robust, efficient, and capable to deal with any kind of object. Therefore, hierarchical data structures are used to deal with complex objects. An algorithm for computing compact sphere tree hierarc...
متن کاملgProximity: Hierarchical GPU-based Operations for Collision and Distance Queries
We present novel parallel algorithms for collision detection and separation distance computation for rigid and deformable models that exploit the computational capabilities of many-core GPUs. Our approach uses thread and data parallelism to perform fast hierarchy construction, updating, and traversal using tight-fitting bounding volumes such as oriented bounding boxes (OBB) and rectangular swep...
متن کاملCollision-free and smooth trajectory computation in cluttered environments
We present a novel trajectory computation algorithm to smooth piecewise linear collision-free trajectories computed by samplebased motion planners. Our approach uses cubic B-splines to generate trajectories which are C almost everywhere, except on a few isolated points. The algorithm performs local spline refinement to compute smooth, collision-free trajectories and it works well even in enviro...
متن کامل